National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Solving methods for bilevel optimization problems
Lžičař, Jiří ; Kopa, Miloš (advisor) ; Branda, Martin (referee)
The presented thesis discusses bilevel programming problems with the focus on solution algorithms. Bilevel programming problem is a hierarchical programming problem, where constraints contain another programming problem. We formulate basic bilevel optimization theory and describe three types of so- lution algorithms for bilevel programming problems: Algorithms based on KKT reformulation where the lower level is replaced by its KKT conditions, algorithms based on optimal value function where the bilevel programming problem is re- duced to a single level problem using the optimal value function of the lower level problem, and algorithms solving linear bilevel programming problems. Using real data for portfolio optimization bilevel programming problems, we compare ability to solve the problems and computing time of some of the pre- sented algorithms. 1
Multi-Objective Optimization Problems with Random Elements - Survey of Approaches
Kaňková, Vlasta
Many economic and financial situations depend simultaneously on a random element and a decision parameter. Mostly, it is possible to influence the above mentioned situation only by an optimization model depending on a probability measure. This optimization problem can be static (one-stage), dynamic with finite or infinite horizon, single-objective or multi-objective. We focus on one-stage multi-objective problems corresponding to applications those are suitable to evaluate simultaneously by a few objectives. The aim of the contribution is to give a survey of different approaches (as they are known from the literature) of the above mentioned applications. To this end we start with well-known mean-risk model and continue with other known approaches. Moreover, we try to complete every model by a suitable application. Except an analysis of a choice of the objective functions type we try to discuss suitable constraints set with respect to the problem base, possible investigation and relaxation. At the end we mention properties of the problem in the case when the theoretical „underlying“ probability measure is replaced by its „deterministic“ or „stochastic“ estimate.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.